If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n
نویسندگان
چکیده
منابع مشابه
StUSPACE(log n) <= DSPACE(log²n / log log n)
We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کامل(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP
The aim of this paper is to present a proof of the equivalence of the equalities N P = PCP(log log n; 1) and P = N P. The proof is based on producing long pseudo-random bit strings through random walks on expander graphs. This technique also implies that for any language in N P there exists a restricted veriier using log n + c, c is a constant, random bits. Furthermore, we prove that the equali...
متن کاملRuspace(log N) Dspace(log 2 N= Log Log N) 1
We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملAn O(n)-space O(log N= Log Log N + F )-query Time Algorithm for 3-d Dominance Reporting
We present a linear-space algorithm for handling the three-dimensional dominance reporting problem: given a set S of n three-dimensional points, design a data structure for S so that the points in S which dominate a given query point can be reported quickly. Under the variation of the RAM model introduced by Fredman and Willard 8], our algorithm achieves O(log n= loglog n + f) query time, where...
متن کاملA Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\log\Delta / \log^2\log\Delta)$ Rounds
We present a deterministic distributed 2-approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGESTmodel whose round complexity isO(log n log∆/ log log∆). This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the (2 + ǫ)-approximation algorithm of [BCS17], improving the dependency on ǫ from linear to logari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90008-6